Using dual feasible functions to construct fast lower bounds for routing and location problems
نویسندگان
چکیده
منابع مشابه
Using dual feasible functions to construct fast lower bounds for routing and location problems
In cutting and packing problems, Dual Feasible Functions (DFFs) represent a well established tool for deriving high quality lower bounds in very short times. A well-known DFF lower bounding approach consists of using DFFs to rapidly generate feasible values for the dual variables of a Column Generation (CG) program (i.e., of an extended formulation commonly associated to CG). This paper present...
متن کاملLower Bounds Using Dual Polynomials ∗
Representations of Boolean functions by real polynomials play an important role in complexity theory. Typically, one is interested in the least degree of a polynomial p(x 1 ,. .. , x n) that approximates or sign-represents a given Boolean function f (x 1 ,. .. , x n). This article surveys a new and growing body of work in communication complexity that centers around the dual objects, i.e., poly...
متن کاملNew lower bounds for online k-server routing problems
In a k-server routing problem k ≥ 1 servers move in a metric space in order to visit specified points or carry objects from sources to destinations. In the online version requests arrive online while the servers are traveling. Two classical objective functions are to minimize the makespan, i.e., the time when the last server has completed its tour, (k-Traveling Salesman Problem or k-tsp) and to...
متن کاملConvergent Lower Bounds for Packing Problems via Restricted Dual Polytopes
Cutting-stock and bin-packing problems have been widely studied in the operations research literature for their large range of industrial applications. Many integer programming models have been proposed for them. The most famous is from Gilmore and Gomory [5] and relies on a column generation scheme. Column generation methods are known to have convergence issues, and (when minimizing) no useful...
متن کاملNew classes of fast lower bounds for bin packing problems
The bin packing problem is one of the classical NP-hard optimization problems. In this paper, we present a simple generic approach for obtaining new fast lower bounds, based on dual feasible functions. Worst-case analysis as well as computational results show that one of our classes clearly outperforms the previous best “economical” lower bound for the bin packing problem by Martello and Toth, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2015
ISSN: 0166-218X
DOI: 10.1016/j.dam.2014.05.017